An algorithm for the construction of concentrators from 2 x 2 sorters
نویسندگان
چکیده
This paper presents polynomial-time algorithms for the construction of deterministic and internally non-blocking concentrators from multi-stage cascades of 2x2 sorters. The approach is a generalization of "Fast Knockout" and "Sortout" techniques. The goal is to construct best known m-to-n networks of 2x2 sorters for m-to-n concentration, where m and n are within the practical range. The main criterion on the complexity of concentration is the number of stages in the cascade.
منابع مشابه
Encoding Cardinality Constraints using Generalized Selection Networks
Boolean cardinality constraints state that at most (at least, or exactly) k out of n propositional literals can be true. We propose a new class of selection networks that can be used for an efficient encoding of them. Several comparator networks have been proposed recently for encoding cardinality constraints and experiments have proved their efficiency. Those were based mainly on the odd-even ...
متن کاملAn Irregular Lattice Pore Network Model Construction Algorithm
Pore network modeling uses a network of pores connected by throats to model the void space of a porous medium and tries to predict its various characteristics during multiphase flow of various fluids. In most cases, a non-realistic regular lattice of pores is used to model the characteristics of a porous medium. Although some methodologies for extracting geologically realistic irregular net...
متن کاملSemi-Explicit Construction of Linear Size Concentrators and Superconcentrators
Concentration and superconcentration operations play a central role in the constructions of nonblocking switching networks. This was established in a seminal effort by Bassalygo and Pinsker who showed that an n-input nonblocking switching network can be constructed with O(n log n) crosspoints if concentrators can be constructed with O(n) crosspoints. Starting with the pioneering work of Marguli...
متن کاملConstructing Sorting Networks from k-Sorters
We study the problem of using sorters of k vabxes to form large sorting and merging networks. For n an integral power of k, we show how to merge k sorted vectors of length n/k each using 4 log, n 3 layers of k-sorters and 4 log* n 5 layers of k=ittiqut binary mergers. As a result, we show how to sort R v&es using 2 iag$ n -log, n layers of k-sorters and 2 logf n 3 fog& n * I fayers of k-input l...
متن کاملAn Optimal Algorithm for the δ-ziti Method to Solve Some Mathematical Problems
The numerical approximation methods of the differential problems solution are numerous and various. Their classifications are based on several criteria: Consistency, precision, stability, convergence, dispersion, diffusion, speed and many others. For this reason a great interest must be given to the construction and the study of the associated algorithm: indeed the algorithm must be simple, rob...
متن کامل